Parallel algorithms for the domination problems in trapezoid graphs
نویسندگان
چکیده
منابع مشابه
The 2-Tuple Domination Problem on Trapezoid Graphs
Given a simple graph G = (V, E) and a fixed positive integer k. In a graph G, a vertex is said to dominate itself and all of its neighbors. A set D ⊆ V is called a k-tuple dominating set if every vertex in V is dominated by at least k vertices of D. The k-tuple domination problem is to find a minimum cardinality k-tuple dominating set. This problem is NP-complete for general graphs. In this pap...
متن کاملAlgorithms for alpha-rate domination problems on weighted graphs
In this article, we investigate a domination set problem variant on vertex-weighted graphs. In the last few years, several algorithms have been presented for solving the minimum alpha and alpha-rate domination problem (also known as the positive influence dominating sets problem) on simple graphs. We recently proposed an algorithm for alpha-rate domination on weighted graphs based on randomised...
متن کاملNew Algorithms for Weighted $k$-Domination and Total $k$-Domination Problems in Proper Interval Graphs
Given a positive integer k, a k-dominating set in a graph G is a set of vertices such that every vertex not in the set has at least k neighbors in the set. A total k-dominating set, also known as a k-tuple total dominating set, is a set of vertices such that every vertex of the graph has at least k neighbors in the set. The problems of finding the minimum size of a k-dominating, resp. total k-d...
متن کاملTrapezoid Graphs and Generalizations, Geometry and Algorithms
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan et al. [3]. They propose an 0(n2) algorithm for chromatic number and a less efficient algorithm for maximum clique on trapezoid graphs. Based on a geometric representation of trapezoid graphs by boxes in the plane we design optimal, i.e., O(n log ...
متن کاملPolynomial-time Algorithms for Weighted Efficient Domination Problems in AT-free Graphs and Dually Chordal Graphs
An efficient dominating set (or perfect code) in a graph is a set of vertices the closed neighborhoods of which partition the vertex set of the graph. The minimum weight efficient domination problem is the problem of finding an efficient dominating set of minimum weight in a given vertex-weighted graph; the maximum weight efficient domination problem is defined similarly. We develop a framework...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1997
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(96)00052-2